Communication Complexity
نویسنده
چکیده
The disjointness problem is one of the most important questions in communication complexity, and lower bounds for disjointness have been used to derive lower bounds for streaming algorithms, data structures, barriers in complexity (algebraization), approaches for circuit lower bounds, proof complexity, game theory. Some sources on this include the survey “The Story of Set Disjointness” by Chattopadhyay and Pittasi http://www.cs.toronto.edu/~arkadev/ commSurvey.pdf, and the paper “Unifying the Landscape of Cell-Probe Lower Bounds” by Patrascu http://people.csail.mit.edu/mip/papers/structures/paper.pdf. We’ll first prove that R(DISJ) ≥ Ω( √ n), which was shown by Babai, Frankl, and Simon (1987), and then strengthen the result to a linear lower bound.
منابع مشابه
Connections, Communication and Collaboration in Healthcare’s Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”
A more sophisticated understanding of the unpredictable, disorderly and unstable aspects of healthcare organisations is developing in the knowledge translation (KT) literature. In an article published in this journal, Kitson et al introduced a new model for KT in healthcare based on complexity theory. The Knowledge Translation Complexity Network Model (KTCNM) provides a fresh perspective by mak...
متن کاملThe effect of knowledge based economic indicators on the countries' economic complexity
Countries’ economic growth and development are significantly dependent on their productive capacity. In this research, we aimed to investigate which components of a knowledge-based economy has a more meaningful role in the production capacity. In order to measure production capacity, we used one of the most up-to-date indexes, the economic complexity index. The research used data panel consist...
متن کاملAdaptive Subcarrier Assignment and Power Distribution in Multiuser OFDM Systems with Proportional Data Rate Requirement
A low complexity dynamic subcarrier and power allocation methodology for downlink communication in an OFDM-based multiuser environment is developed. The problem of maximizing overall capacity with constraints on total power consumption, bit error rate and data rate proportionality among users requiring different QOS specifications is formulated. Assuming perfect knowledge of the instantaneo...
متن کاملDistance-Aware Beamforming for Multiuser Secure Communication Systems
Typical cryptography schemes are not well suited for low complexity types of equipment, e.g., Internet of things (IoT) devices, as they may need high power or impose high computational complexity on the device. Physical (PHY) layer security techniques such as beamforming (in multiple antennas systems) are possible alternatives to provide security for such applications. In this paper, we consid...
متن کاملA new method for accelerating impossible differential cryptanalysis and its application on LBlock
Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...
متن کاملکاربرد سایبرنتیک در سازمانهای اجتماعی
As a new science, cybernetcs was introduced by Norbert Weiner in 1940. More appropriately stated, it is a new science which deals with an old subject-matter, that is, the study of the science of communication and control in machinesand animals. The purpose of this article is to demonstrate how this theory can be utilized in social organizations. Communication is the most vital component of any...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012